Chemical bonding in representative astrophysically relevant neutral,cation, and anion HCnH chains

Most existing studies assign a polyynic and cumulenic character of chemical bonding in carbon-based chains relying on values of the bond lengths. Building on our recent work, in this paper we add further evidence on the limitations of such an analysis and demonstrate the significant insight gained via natural bond analysis. Presently reported results include atomic charges, natural bond order and valence indices obtained from ab initio computations for representative members of the astrophysically relevant neutral and charged HC_2k/2k+1H chain family. They unravel a series of counter-intuitive aspects and/or help naive intuition in properly understanding microscopic processes, e.g., electron removal from or electron attachment to a neutral chain. Demonstrating that the Wiberg indices adequately quantify the chemical bonding structure of the HC_2k/2k+1H chains—while the often heavily advertised Mayer indices do not—represents an important message conveyed by the present study.     

Na原子链表面等离激元特性的含时密度泛函研究

本文用含时密度泛函理论研究了线性Na原子链的表面等离激元机理.主要在原子尺度下模拟计算了体系随着原子数增加及原子间距变化的集体激发过程.研究发现线性原子链有一个普遍的特性——存在一个纵模和两个横模.两个横模一般在实验上很难被观测到.纵模随着原子链长度增加,能量红移的同时,该纵模主峰的强度呈线性增长.随着原子个数的增加,端点模式(TE)开始蓝移,能量和偶极强度都逐渐趋向饱和.横模能量被劈裂的原因概括如下:(一)每个位置的电子受到的势不同,在两端的电子受到的势要比在中间的电子受到的势要高,因此两端的电荷积累也比中间多;(二)端点存在悬挂键,所以中间的电子-电子间相互作用与端点的不一样,这两方面又都与原子间距d有关.     

An inequality connecting entropy distance,Fisher Information and large deviations

In this paper we introduce a new generalisation of the relative Fisher Information for Markov jump processes on a finite or countable state space, and prove an inequality which connects this object with the relative entropy and a large deviation rate functional. In addition to possessing various favourable properties, we show that this generalised Fisher Information converges to the classical Fisher Information in an appropriate limit. We then use this generalised Fisher Information and the aforementioned inequality to qualitatively study coarse-graining problems for jump processes on discrete spaces.     

An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines

In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison with a widely used decomposition package.     

Kalman filtering of a space-time Markov random field

In this paper, finite-dimensional recursive filters for space-time Markov random fields are derived. These filters can be used with the expectation maximization (EM) algorithm to yield maximum likelihood estimates of the parameters of the model.     

Simulated annealing with noisy or imprecise energy measurements

The annealing algorithm (Ref. 1) is modified to allow for noisy or imprecise measurements of the energy cost function. This is important when the energy cannot be measured exactly or when it is computationally expensive to do so. Under suitable conditions on the noise/imprecision, it is shown that the modified algorithm exhibits the same convergence in probability to the globally minimum energy states as the annealing algorithm (Ref. 2). Since the annealing algorithm will typically enter and exit the minimum energy states infinitely often with probability one, the minimum energy state visited by the annealing algorithm is usually tracked. The effect of using noisy or imprecise energy measurements on tracking the minimum energy state visited by the modified algorithms is examined.The research reported here has been supported under Contracts AFOSR-85-0227, DAAG-29-84-K-0005, and DAAL-03-86-K-0171 and a Purdue Research Initiation Grant.     

Weak convergence of the U-statistic and weak invariance of the one-sample rank order statistic for Markov processes and ARMA models

Harel and Puri (1989, J. Multivariate Anal. 29) studied the asymptotic behavior of the U-statistic and the one-sample rank order statistic for nonstationary absolutely regular processes. In this note, we present some applications of these results for Markov processes as well as ARMA processes.     

Modelling recruitment training in mathematical human resource planning

This paper deals with mathematical human resource planning; more specifically, it suggests a new model for a manpower‐planning system. In general, we study a k‐classed hierarchical system where the workforce demand at each time period is satisfied through internal mobility and recruitment. The motivation for this work is based on various European Union incentives, which promote regional or local government assistance programs that could be exploited by firms not only for hiring and training newcomers, but also to improve the skills and knowledge of their existing personnel. In this respect, in our augmented mobility model we establish a new ‘training/standby’ class, which serves as a manpower inventory position for potential recruits. This class, which may very well be internal or external to the system, is incorporated into the framework of a non‐homogeneous Markov chain model. Furthermore, cost objectives are employed using the goal‐programming approach, under different operating assumptions, in order to minimize the operational cost in the presence of system's constraints and regulations. Copyright © 2002 John Wiley & Sons, Ltd.